Every monotone graph property has a sharp threshold
نویسندگان
چکیده
منابع مشابه
Every Monotone Graph Property Has a Sharp Threshold Ehud Friedgut and Gil Kalai
In their seminal work which initiated random graph theory Erd os and R enyi discovered that many graph properties have sharp thresholds as the number of vertices tends to in nity We prove a conjecture of Linial that every monotone graph property has a sharp threshold This follows from the following theorem Let Vn p f g denote the Hamming space endowed with the probability measure p de ned by p ...
متن کاملEvery Monotone 3-Graph Property is Testable
Let k ≥ 2 be a fixed integer and P be a property of k-uniform hypergraphs. In other words, P is a (typically infinite) family of k-uniform hypergraphs and we say a given hypergraph H satisfies P if H ∈ P . For a given constant η > 0 a k-uniform hypergraph H on n vertices is η-far from P if no hypergraph obtained from H by changing (adding or deleting) at most ηn edges in H satisfies P . More pr...
متن کاملThe Property of Having a $k$-Regular Subgraph Has a Sharp Threshold
We prove that the property of containing a k-regular subgraph in the random graph model G(n, p) has a sharp threshold for k ≥ 3. We also show how to use similar methods to obtain an easy prove for the (known fact of) sharpness of having a non empty k-core for k ≥ 3.
متن کاملEvery rayless graph has an unfriendly partition
We prove that every rayless graph has an unfriendly partition.
متن کاملEvery Deterministic Nonclairvoyant Scheduler has a Suboptimal Load Threshold
We prove a surprising lower bound for resource augmented nonclairvoyant algorithms for scheduling jobs with sublinear nondecreasing speed-up curves on multiple processors with the objective of average response time. Edmonds in STOC99 shows that the algorithm Equi-partition is a (2+ǫ)-speed Θ( ǫ )-competitive algorithm. We define its speed threshold to be 2 because it is constant competitive whe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1996
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-96-03732-x